A multiple-precision division algorithm
نویسنده
چکیده
The classical algorithm for multiple -precision division normalizes digits during each step and sometimes makes correction steps when the initial guess for the quotient digit turns out to be wrong. A method is presented that runs faster by skipping most of the intermediate normalization and recovers from wrong guesses without separate correction steps.
منابع مشابه
Division of Floating Point Expansions with an Application to the Computation of a Determinant
Floating point expansion is a technique for implementing multiple precision using a processor's oating point unit instead of its integer unit. Research on this subject has arised recently from the observation that the oating point unit becomes a more and more eÆcient part of modern computers. Many simple arithmetic operators and some very useful geometric operators have already been presented o...
متن کاملA Hardware Algorithm for Variable-Precision Division
This paper presents an e cient hardware algorithm for variable precision division The algorithm is based on a well known convergence algorithm however modi cations are made to allow it to e ciently handle variable precision operands The proposed al gorithm reduces the number of xed precision operation by only computing signi cant words in intermediate results Compared to previous variable preci...
متن کاملA Blind Adaptive Kalman-SIC MUD Algorithm of the Wireless Multiple Access Mobile Communication System
The multi-user detection precision of successive interference cancellation (SIC) detector is always affected by the decision error diffusion. This paper focuses on the SIC algorithm of direct sequence spread spectrum code division multiple access (DS-CDMA) system with strong multiple access interference (MAI) and inter symbol interference (ISI). A blind adaptive Kalman-SIC multi-user detection ...
متن کاملThe Karatsuba Middle Product for Integers
We study the problem of computing middle products of multipleprecision integers. In particular we adapt the Karatsuba polynomial middle product algorithm to the integer case, showing how to efficiently mitigate the failure of bilinearity of the integer middle product noted by Hanrot, Quercia and Zimmermann. We discuss an implementation in GMP and applications to integer division.
متن کاملAnatomy of the Pentium Bug
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor pairs yield relative errors whose most significant bit is uniformly distributed from the 14th to the 23rd (least significant) bit. This corresponds to a rate of one error every 40 billion random single precision divisions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996